Optimal modal truncation

نویسندگان

چکیده

This paper revisits modal truncation from an optimisation point of view. In particular, the concept dominant poles is formulated with respect to different system norms as solution associated optimal problem. The latter reformulated equivalent convex integer or mixed-integer program. Numerical examples highlight and approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Truncation Strategies for Optimal

yearly review of activities and projects CrosSCutS (triannually): newsletter featuring announcements relevant to our users as well as research highlights in the eld of high-performance computing Speedup Journal (biannually): proceedings of the SPEEDUP Workshops on Vector and Parallel Computing, published on behalf of the SPEEDUP Society User's Guide: manual to hardware and software at CSCS/SCSC...

متن کامل

Optimal truncation in matching markets

Since no stable matching mechanism can induce truth-telling as a dominant strategy for all participants, there is often room in matching markets for strategic misrepresentation (Roth [25]). In this paper we study a natural form of strategic misrepresentation: reporting a truncation of one’s true preference list. Roth and Rothblum [28] prove an important but abstract result: in certain symmetric...

متن کامل

Optimal Sensors Location Using Modal Assurance Criterion in Modal Identification of Concrete Gravity Dams

Determination of the optimal sensors location in order to identify of modal parameters, especially in large structures such as dams, is one of the practical issues, which is widely used in damage detection and structural health monitoring. The main objective of this study is to obtain the most information from the dynamic response in a concrete gravity dam by minimizing the non-diagonal element...

متن کامل

Truncation Strategies for Optimal Krylov Subspace Methods∗

Optimal Krylov subspace methods like GMRES and GCR have to compute an orthogonal basis for the entire Krylov subspace to compute the minimal residual approximation to the solution. Therefore, when the number of iterations becomes large, the amount of work and the storage requirements become excessive. In practice one has to limit the resources. The most obvious ways to do this are to restart GM...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Systems & Control Letters

سال: 2021

ISSN: ['1872-7956', '0167-6911']

DOI: https://doi.org/10.1016/j.sysconle.2021.105011